On the Expressive Power of Graph Logic
نویسنده
چکیده
Graph Logic, a query language being a sublogic of Monadic Second Order Logic is studied in [CGG02]. In the paper [DGG04] the expressiveness power of Graph Logic is examined, and it is shown, for many MSO properties, how to express them in Graph Logic. But despite of the positive examples, it is conjectured there that Graph Logic is strictly less expressive than MSO Logic. Here we give a proof of this conjecture.
منابع مشابه
Understanding the semantics of conceptual graphs
In this paper, we propose a simple and well established semantics for conceptual graphs. This model theoretic semantics is an alternative to previous approaches, where a game theoretical semantics has been suggested. In addition to that, we thoroughly compare conceptual graphs with First Order Predicate Logic (FOPL). The comparison is based on semantics. Based on this comparison, we present som...
متن کاملTopology Control in Wireless Sensor Network using Fuzzy Logic
Network sensors consist of sensor nodes in which every node covers a limited area. The most common use ofthese networks is in unreachable fields.Sink is a node that collects data from other nodes.One of the main challenges in these networks is the limitation of nodes battery (power supply). Therefore, the use oftopology control is required to decrease power consumption and increase network acce...
متن کاملExpressive Path Queries on Graph with Data
Graph data models have recently become popular owing to their applications, e.g., in social networks and the semantic web. Typical navigational query languages over graph databases — such as Conjunctive Regular Path Queries (CRPQs) — cannot express relevant properties of the interaction between the underlying data and the topology. Two languages have been recently proposed to overcome this prob...
متن کاملExpressive Path Queries on Graphs with Data
Graph data models have recently become popular owing to their applications, e.g., in social networks, semantic web. Typical navigational query languages over graph databases — such as Conjunctive Regular Path Queries (CRPQs) — cannot express relevant properties of the interaction between the underlying data and the topology. Two languages have been recently proposed to overcome this problem: wa...
متن کاملOn the Verification of Logically Decorated Graph Transformations
We address the problem of reasoning on graph transformations featuring actions such as addition and deletion of nodes and edges, node merging and cloning, node or edge labelling and edge redirection. First, we introduce the considered graph rewrite systems which are parameterized by a given logic L. Formulas of L are used to label graph nodes and edges. In a second step, we tackle the problem o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006